TSTP Solution File: SET593^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET593^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:07:25 EDT 2024
% Result : Theorem 0.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 18
% Syntax : Number of formulae : 61 ( 2 unt; 9 typ; 0 def)
% Number of atoms : 446 ( 143 equ; 0 cnn)
% Maximal formula atoms : 14 ( 8 avg)
% Number of connectives : 513 ( 98 ~; 73 |; 56 &; 259 @)
% ( 4 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 69 ( 69 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 7 con; 0-3 aty)
% Number of variables : 91 ( 0 ^ 62 !; 28 ?; 91 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_4,type,
sP0: ( a > $o ) > ( a > $o ) > ( a > $o ) > $o ).
thf(func_def_5,type,
sK1: ( a > $o ) > ( a > $o ) > ( a > $o ) > a ).
thf(func_def_6,type,
sK2: a > $o ).
thf(func_def_7,type,
sK3: a > $o ).
thf(func_def_8,type,
sK4: a > $o ).
thf(func_def_9,type,
sK5: a ).
thf(func_def_12,type,
ph7:
!>[X0: $tType] : X0 ).
thf(f61,plain,
$false,
inference(avatar_sat_refutation,[],[f34,f39,f44,f55,f60]) ).
thf(f60,plain,
( spl6_1
| spl6_3
| ~ spl6_4 ),
inference(avatar_contradiction_clause,[],[f59]) ).
thf(f59,plain,
( $false
| spl6_1
| spl6_3
| ~ spl6_4 ),
inference(subsumption_resolution,[],[f58,f38]) ).
thf(f38,plain,
( ( $true
!= ( sK3 @ sK5 ) )
| spl6_3 ),
inference(avatar_component_clause,[],[f36]) ).
thf(f36,plain,
( spl6_3
<=> ( $true
= ( sK3 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
thf(f58,plain,
( ( $true
= ( sK3 @ sK5 ) )
| spl6_1
| ~ spl6_4 ),
inference(subsumption_resolution,[],[f57,f29]) ).
thf(f29,plain,
( ( ( sK2 @ sK5 )
!= $true )
| spl6_1 ),
inference(avatar_component_clause,[],[f27]) ).
thf(f27,plain,
( spl6_1
<=> ( ( sK2 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
thf(f57,plain,
( ( ( sK2 @ sK5 )
= $true )
| ( $true
= ( sK3 @ sK5 ) )
| ~ spl6_4 ),
inference(trivial_inequality_removal,[],[f56]) ).
thf(f56,plain,
( ( $true != $true )
| ( $true
= ( sK3 @ sK5 ) )
| ( ( sK2 @ sK5 )
= $true )
| ~ spl6_4 ),
inference(superposition,[],[f22,f43]) ).
thf(f43,plain,
( ( ( sK4 @ sK5 )
= $true )
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f41]) ).
thf(f41,plain,
( spl6_4
<=> ( ( sK4 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
thf(f22,plain,
! [X4: a] :
( ( ( sK4 @ X4 )
!= $true )
| ( ( sK2 @ X4 )
= $true )
| ( ( sK3 @ X4 )
= $true ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f18,plain,
( ( ( ( ( sK4 @ sK5 )
= $true )
& ( $true
!= ( sK3 @ sK5 ) )
& ( ( sK2 @ sK5 )
!= $true ) )
| ( $true
= ( sP0 @ sK2 @ sK3 @ sK4 ) ) )
& ! [X4: a] :
( ( ( sK2 @ X4 )
= $true )
| ( ( sK3 @ X4 )
= $true )
| ( ( sK4 @ X4 )
!= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f15,f17,f16]) ).
thf(f16,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ? [X3: a] :
( ( ( X2 @ X3 )
= $true )
& ( ( X1 @ X3 )
!= $true )
& ( ( X0 @ X3 )
!= $true ) )
| ( $true
= ( sP0 @ X0 @ X1 @ X2 ) ) )
& ! [X4: a] :
( ( $true
= ( X0 @ X4 ) )
| ( $true
= ( X1 @ X4 ) )
| ( ( X2 @ X4 )
!= $true ) ) )
=> ( ( ? [X3: a] :
( ( ( sK4 @ X3 )
= $true )
& ( $true
!= ( sK3 @ X3 ) )
& ( ( sK2 @ X3 )
!= $true ) )
| ( $true
= ( sP0 @ sK2 @ sK3 @ sK4 ) ) )
& ! [X4: a] :
( ( ( sK2 @ X4 )
= $true )
| ( ( sK3 @ X4 )
= $true )
| ( ( sK4 @ X4 )
!= $true ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f17,plain,
( ? [X3: a] :
( ( ( sK4 @ X3 )
= $true )
& ( $true
!= ( sK3 @ X3 ) )
& ( ( sK2 @ X3 )
!= $true ) )
=> ( ( ( sK4 @ sK5 )
= $true )
& ( $true
!= ( sK3 @ sK5 ) )
& ( ( sK2 @ sK5 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f15,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ? [X3: a] :
( ( ( X2 @ X3 )
= $true )
& ( ( X1 @ X3 )
!= $true )
& ( ( X0 @ X3 )
!= $true ) )
| ( $true
= ( sP0 @ X0 @ X1 @ X2 ) ) )
& ! [X4: a] :
( ( $true
= ( X0 @ X4 ) )
| ( $true
= ( X1 @ X4 ) )
| ( ( X2 @ X4 )
!= $true ) ) ),
inference(rectify,[],[f10]) ).
thf(f10,plain,
? [X2: a > $o,X1: a > $o,X0: a > $o] :
( ( ? [X4: a] :
( ( $true
= ( X0 @ X4 ) )
& ( $true
!= ( X1 @ X4 ) )
& ( ( X2 @ X4 )
!= $true ) )
| ( ( sP0 @ X2 @ X1 @ X0 )
= $true ) )
& ! [X3: a] :
( ( ( X2 @ X3 )
= $true )
| ( ( X1 @ X3 )
= $true )
| ( ( X0 @ X3 )
!= $true ) ) ),
inference(definition_folding,[],[f8,f9]) ).
thf(f9,plain,
! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X5: a] :
( ( ( X0 @ X5 )
= $true )
& ( $true
!= ( X1 @ X5 ) )
& ( ( X2 @ X5 )
!= $true ) )
| ( ( sP0 @ X2 @ X1 @ X0 )
!= $true ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[=])]) ).
thf(f8,plain,
? [X2: a > $o,X1: a > $o,X0: a > $o] :
( ( ? [X4: a] :
( ( $true
= ( X0 @ X4 ) )
& ( $true
!= ( X1 @ X4 ) )
& ( ( X2 @ X4 )
!= $true ) )
| ? [X5: a] :
( ( ( X0 @ X5 )
= $true )
& ( $true
!= ( X1 @ X5 ) )
& ( ( X2 @ X5 )
!= $true ) ) )
& ! [X3: a] :
( ( ( X2 @ X3 )
= $true )
| ( ( X1 @ X3 )
= $true )
| ( ( X0 @ X3 )
!= $true ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
? [X1: a > $o,X0: a > $o,X2: a > $o] :
( ( ? [X4: a] :
( ( $true
!= ( X1 @ X4 ) )
& ( ( X2 @ X4 )
!= $true )
& ( $true
= ( X0 @ X4 ) ) )
| ? [X5: a] :
( ( ( X2 @ X5 )
!= $true )
& ( ( X0 @ X5 )
= $true )
& ( $true
!= ( X1 @ X5 ) ) ) )
& ! [X3: a] :
( ( ( X1 @ X3 )
= $true )
| ( ( X2 @ X3 )
= $true )
| ( ( X0 @ X3 )
!= $true ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X1: a > $o,X0: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( ( X0 @ X3 )
= $true )
=> ( ( ( X1 @ X3 )
= $true )
| ( ( X2 @ X3 )
= $true ) ) )
=> ( ! [X4: a] :
( ( ( ( X2 @ X4 )
!= $true )
& ( $true
= ( X0 @ X4 ) ) )
=> ( $true
= ( X1 @ X4 ) ) )
& ! [X5: a] :
( ( ( ( X0 @ X5 )
= $true )
& ( $true
!= ( X1 @ X5 ) ) )
=> ( ( X2 @ X5 )
= $true ) ) ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( ( X0 @ X3 )
= $true )
=> ( ( ( X1 @ X3 )
= $true )
| ( ( X2 @ X3 )
= $true ) ) )
=> ( ! [X4: a] :
( ( ( $true
= ( X0 @ X4 ) )
& ( ( X2 @ X4 )
!= $true ) )
=> ( $true
= ( X1 @ X4 ) ) )
& ! [X5: a] :
( ( ( $true
!= ( X1 @ X5 ) )
& ( ( X0 @ X5 )
= $true ) )
=> ( ( X2 @ X5 )
= $true ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( X0 @ X3 )
=> ( ( X2 @ X3 )
| ( X1 @ X3 ) ) )
=> ( ! [X4: a] :
( ( ( X0 @ X4 )
& ~ ( X2 @ X4 ) )
=> ( X1 @ X4 ) )
& ! [X5: a] :
( ( ~ ( X1 @ X5 )
& ( X0 @ X5 ) )
=> ( X2 @ X5 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( X0 @ X3 )
=> ( ( X2 @ X3 )
| ( X1 @ X3 ) ) )
=> ( ! [X3: a] :
( ( ( X0 @ X3 )
& ~ ( X2 @ X3 ) )
=> ( X1 @ X3 ) )
& ! [X3: a] :
( ( ~ ( X1 @ X3 )
& ( X0 @ X3 ) )
=> ( X2 @ X3 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( X0 @ X3 )
=> ( ( X2 @ X3 )
| ( X1 @ X3 ) ) )
=> ( ! [X3: a] :
( ( ( X0 @ X3 )
& ~ ( X2 @ X3 ) )
=> ( X1 @ X3 ) )
& ! [X3: a] :
( ( ~ ( X1 @ X3 )
& ( X0 @ X3 ) )
=> ( X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8cFb63LpkN/Vampire---4.8_11988',cBOOL_PROP_52_pme) ).
thf(f55,plain,
~ spl6_2,
inference(avatar_contradiction_clause,[],[f54]) ).
thf(f54,plain,
( $false
| ~ spl6_2 ),
inference(subsumption_resolution,[],[f53,f48]) ).
thf(f48,plain,
( ( ( sK3 @ ( sK1 @ sK2 @ sK3 @ sK4 ) )
!= $true )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f47]) ).
thf(f47,plain,
( ( $true != $true )
| ( ( sK3 @ ( sK1 @ sK2 @ sK3 @ sK4 ) )
!= $true )
| ~ spl6_2 ),
inference(superposition,[],[f20,f33]) ).
thf(f33,plain,
( ( $true
= ( sP0 @ sK2 @ sK3 @ sK4 ) )
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f31]) ).
thf(f31,plain,
( spl6_2
<=> ( $true
= ( sP0 @ sK2 @ sK3 @ sK4 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
thf(f20,plain,
! [X2: a > $o,X0: a > $o,X1: a > $o] :
( ( ( sP0 @ X2 @ X1 @ X0 )
!= $true )
| ( ( X1 @ ( sK1 @ X2 @ X1 @ X0 ) )
!= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ( ( X0 @ ( sK1 @ X2 @ X1 @ X0 ) )
= $true )
& ( ( X1 @ ( sK1 @ X2 @ X1 @ X0 ) )
!= $true )
& ( ( X2 @ ( sK1 @ X2 @ X1 @ X0 ) )
!= $true ) )
| ( ( sP0 @ X2 @ X1 @ X0 )
!= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f12,f13]) ).
thf(f13,plain,
! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X3: a] :
( ( ( X0 @ X3 )
= $true )
& ( ( X1 @ X3 )
!= $true )
& ( ( X2 @ X3 )
!= $true ) )
=> ( ( ( X0 @ ( sK1 @ X2 @ X1 @ X0 ) )
= $true )
& ( ( X1 @ ( sK1 @ X2 @ X1 @ X0 ) )
!= $true )
& ( ( X2 @ ( sK1 @ X2 @ X1 @ X0 ) )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X3: a] :
( ( ( X0 @ X3 )
= $true )
& ( ( X1 @ X3 )
!= $true )
& ( ( X2 @ X3 )
!= $true ) )
| ( ( sP0 @ X2 @ X1 @ X0 )
!= $true ) ),
inference(rectify,[],[f11]) ).
thf(f11,plain,
! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X5: a] :
( ( ( X0 @ X5 )
= $true )
& ( $true
!= ( X1 @ X5 ) )
& ( ( X2 @ X5 )
!= $true ) )
| ( ( sP0 @ X2 @ X1 @ X0 )
!= $true ) ),
inference(nnf_transformation,[],[f9]) ).
thf(f53,plain,
( ( ( sK3 @ ( sK1 @ sK2 @ sK3 @ sK4 ) )
= $true )
| ~ spl6_2 ),
inference(subsumption_resolution,[],[f52,f46]) ).
thf(f46,plain,
( ( ( sK2 @ ( sK1 @ sK2 @ sK3 @ sK4 ) )
!= $true )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f45]) ).
thf(f45,plain,
( ( $true != $true )
| ( ( sK2 @ ( sK1 @ sK2 @ sK3 @ sK4 ) )
!= $true )
| ~ spl6_2 ),
inference(superposition,[],[f19,f33]) ).
thf(f19,plain,
! [X2: a > $o,X0: a > $o,X1: a > $o] :
( ( ( sP0 @ X2 @ X1 @ X0 )
!= $true )
| ( ( X2 @ ( sK1 @ X2 @ X1 @ X0 ) )
!= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f52,plain,
( ( ( sK2 @ ( sK1 @ sK2 @ sK3 @ sK4 ) )
= $true )
| ( ( sK3 @ ( sK1 @ sK2 @ sK3 @ sK4 ) )
= $true )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f51]) ).
thf(f51,plain,
( ( ( sK3 @ ( sK1 @ sK2 @ sK3 @ sK4 ) )
= $true )
| ( ( sK2 @ ( sK1 @ sK2 @ sK3 @ sK4 ) )
= $true )
| ( $true != $true )
| ~ spl6_2 ),
inference(superposition,[],[f22,f50]) ).
thf(f50,plain,
( ( $true
= ( sK4 @ ( sK1 @ sK2 @ sK3 @ sK4 ) ) )
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f49]) ).
thf(f49,plain,
( ( $true != $true )
| ( $true
= ( sK4 @ ( sK1 @ sK2 @ sK3 @ sK4 ) ) )
| ~ spl6_2 ),
inference(superposition,[],[f21,f33]) ).
thf(f21,plain,
! [X2: a > $o,X0: a > $o,X1: a > $o] :
( ( ( sP0 @ X2 @ X1 @ X0 )
!= $true )
| ( ( X0 @ ( sK1 @ X2 @ X1 @ X0 ) )
= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f44,plain,
( spl6_4
| spl6_2 ),
inference(avatar_split_clause,[],[f25,f31,f41]) ).
thf(f25,plain,
( ( $true
= ( sP0 @ sK2 @ sK3 @ sK4 ) )
| ( ( sK4 @ sK5 )
= $true ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f39,plain,
( ~ spl6_3
| spl6_2 ),
inference(avatar_split_clause,[],[f24,f31,f36]) ).
thf(f24,plain,
( ( $true
!= ( sK3 @ sK5 ) )
| ( $true
= ( sP0 @ sK2 @ sK3 @ sK4 ) ) ),
inference(cnf_transformation,[],[f18]) ).
thf(f34,plain,
( ~ spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f23,f31,f27]) ).
thf(f23,plain,
( ( $true
= ( sP0 @ sK2 @ sK3 @ sK4 ) )
| ( ( sK2 @ sK5 )
!= $true ) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET593^5 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 16:36:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.14/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.8cFb63LpkN/Vampire---4.8_11988
% 0.14/0.37 % (12096)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.14/0.37 % (12100)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.14/0.37 % (12097)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.14/0.37 % (12101)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.14/0.37 % (12102)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.14/0.37 % (12100)Instruction limit reached!
% 0.14/0.37 % (12100)------------------------------
% 0.14/0.37 % (12100)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (12100)Termination reason: Unknown
% 0.14/0.37 % (12100)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (12100)Memory used [KB]: 895
% 0.14/0.37 % (12100)Time elapsed: 0.003 s
% 0.14/0.37 % (12100)Instructions burned: 2 (million)
% 0.14/0.37 % (12100)------------------------------
% 0.14/0.37 % (12100)------------------------------
% 0.20/0.37 % (12099)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.20/0.37 % (12103)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.20/0.37 % (12099)Instruction limit reached!
% 0.20/0.37 % (12099)------------------------------
% 0.20/0.37 % (12099)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (12099)Termination reason: Unknown
% 0.20/0.37 % (12099)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (12099)Memory used [KB]: 5500
% 0.20/0.37 % (12099)Time elapsed: 0.003 s
% 0.20/0.37 % (12099)Instructions burned: 2 (million)
% 0.20/0.37 % (12099)------------------------------
% 0.20/0.37 % (12099)------------------------------
% 0.20/0.37 % (12097)Instruction limit reached!
% 0.20/0.37 % (12097)------------------------------
% 0.20/0.37 % (12097)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (12097)Termination reason: Unknown
% 0.20/0.37 % (12097)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (12097)Memory used [KB]: 5500
% 0.20/0.37 % (12097)Time elapsed: 0.006 s
% 0.20/0.37 % (12097)Instructions burned: 5 (million)
% 0.20/0.37 % (12097)------------------------------
% 0.20/0.37 % (12097)------------------------------
% 0.20/0.37 % (12102)First to succeed.
% 0.20/0.37 % (12103)Instruction limit reached!
% 0.20/0.37 % (12103)------------------------------
% 0.20/0.37 % (12103)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (12103)Termination reason: Unknown
% 0.20/0.37 % (12103)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (12103)Memory used [KB]: 5500
% 0.20/0.37 % (12103)Time elapsed: 0.004 s
% 0.20/0.37 % (12103)Instructions burned: 3 (million)
% 0.20/0.37 % (12103)------------------------------
% 0.20/0.37 % (12103)------------------------------
% 0.20/0.37 % (12098)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.20/0.38 % (12101)Also succeeded, but the first one will report.
% 0.20/0.38 % (12102)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for Vampire---4
% 0.20/0.38 % SZS output start Proof for Vampire---4
% See solution above
% 0.20/0.38 % (12102)------------------------------
% 0.20/0.38 % (12102)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (12102)Termination reason: Refutation
% 0.20/0.38
% 0.20/0.38 % (12102)Memory used [KB]: 5500
% 0.20/0.38 % (12102)Time elapsed: 0.007 s
% 0.20/0.38 % (12102)Instructions burned: 4 (million)
% 0.20/0.38 % (12102)------------------------------
% 0.20/0.38 % (12102)------------------------------
% 0.20/0.38 % (12095)Success in time 0.005 s
% 0.20/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------